Constructing efficient solutions structure of multiobjective linear programming
نویسندگان
چکیده
منابع مشابه
Generating epsilon-efficient solutions in multiobjective programming
Scalarization approaches to purposely generating epsilon-efficient solutions of multiobjective programs are investigated and a generic procedure for computing these solutions is proposed and illustrated with an example. Real-life decision making situations in which the solutions are of significance are described.
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملDetermination of the Efficient Set in Multiobjective Linear Programming
This paper develops a method for finding the whole set of efficient points of a multiobjective linear problem. Two algorithms are presented; the first one describes the set of all efficient vertices and all efficient rays of the constraint polyhedron, while the second one generates the set of all efficient faces. The method has been tested on several examples for which numerical results are rep...
متن کاملEfficient Solutions for Uncertain Random Multiobjective Programming Problem
Based on the chance theory, which is founded for modeling complex systems with not only uncertainty but also randomness, this paper is devoted to studying a new kind of multiobjective programming problem where randomness and uncertainty exist simultaneously, called uncertain random multiobjective programming (URMOP) problem. Since an uncertain random variable does not admit an order relationshi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2005
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2004.08.069